Systems and methods for low-complexity mimo detection with analytical leaf-node prediction

ABSTRACT

Systems and methods for providing multiple-input multiple-output (MIMO) detection, comprising a leaf node predictor for receiving a processed communications stream, computing at least one channel metric corresponding to the communications stream for a given channel realization by optimizing a predetermined probability, and analytically generating at least one parameter to output, which at least one parameter corresponds to at least one predicted best leaf node candidate for the given channel realization. The leaf-node predictor may generate, in real-time and without using a look-up table, at least one parameter directly from a given channel metric. Some embodiments analytically generate at least one parameter value for use by a MIMO detector corresponding to a channel metric and store the generated at least one parameter value and corresponding channel metric in a look-up table.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Divisional of and claims priority to U.S. application Ser. No. 12/016,967 which claims priority to U.S. provisional patent application Ser. No. 60/887,241, filed Jan. 30, 2007, and entitled “Low-Complexity MIMO Detection with Analytical Leaf-Node Prediction”, and to U.S. provisional patent application Ser. No. 60/887,235, filed Jan. 30, 2007 and entitled “Low-Complexity MIMO Detection using Leaf-Node Prediction via Look-Up Tables”, both hereby incorporated herein by reference.

BACKGROUND

As consumer demand for high data rate applications, such as streaming video, expands, technology providers are forced to adopt new technologies to provide the necessary bandwidth. Multiple Input Multiple Output (“MIMO”) is an advanced technology that employs multiple transmit antennas and multiple receive antennas to simultaneously transmit multiple parallel data streams. Relative to previous wireless technologies, MIMO enables substantial gains in both system capacity and transmission reliability without requiring an increase in frequency resources.

MIMO systems exploit differences in the paths between transmit and receive antennas to increase data throughput and diversity. As the number of transmit and receive antennas is increased, the capacity of a MIMO channel increases linearly, and the probability of all sub-channels between the transmitter and receiver fading simultaneously decreases exponentially. As might be expected, however, there is a price associated with realization of these benefits. Recovery of transmitted information in a MIMO system becomes increasingly complex with the addition of transmit antennas.

Many multiple-input multiple-output (MIMO) detection algorithms have been previously proposed in the literature. The optimal algorithm is conceptually simple, but is often impractical due to the fact that its complexity increases exponentially with the number of channel inputs. As a result, many algorithms have been proposed to solve the problem with less complexity, with the unfortunate effect of also significantly sacrificing performance.

Many MIMO detectors have been proposed and implemented as exclusively hard detectors that only give the final estimate of the channel input. Most notable is the sphere decoding detector because it can achieve Max-Log performance in an uncoded system with much less complexity on average. A summary of many MIMO detectors may be found in D. W. Waters, “Signal Detection Strategies and Algorithms for multiple-Input Multiple-Output Channels”, Georgia Institute of Technology, PhD dissertation, December 2005, including many variations of the sphere detector that minimize complexity without sacrificing performance. At least one list-sphere detector computes the log-likelihood ratio (LLR) for a channel input. Unfortunately, implementing a list-sphere detector is still quite complex, requiring significant processing resources.

Improvements are desired to achieve a favorable performance-complexity trade-off compared to existing MIMO detectors.

BRIEF DESCRIPTION OF THE DRAWINGS

For a detailed description of exemplary embodiments of the invention, reference will be made to the accompanying drawings in which:

FIG. 1 illustrates an example tree diagram of branches enumerated by a Leaf-Node Prediction (“LNP”) detector in which embodiments may be used to advantage;

FIG. 2 illustrates a block diagram of an exemplary communication system comprising an exemplary MIMO detector;

FIG. 3 shows a block diagram of an exemplary LNP detector in which embodiments may be used to advantage;

FIGS. 4 a and 4 b each illustrate a block diagram of an exemplary leaf-node predictor using a precomputed look-up table;

FIG. 5 illustrates a block diagram of an embodiment using a simulator to generate a look-up table;

FIGS. 6 a and 6 b each illustrate a block diagram of an exemplary leaf-node predictor generate parameters without using a look-up table;

FIG. 7 shows a graph representing the numerical values of the function Dmin(N₁) for 64 QAM generated by embodiments;

FIG. 8 illustrates a method of leaf-node prediction according to embodiments;

FIG. 9 illustrates a block diagram of an exemplary LNP detector, for computing LLR values, in which embodiments may be used to advantage;

FIG. 10 illustrates example decision regions for N₁=6 and N₁=11 given internal constellation points;

FIG. 11 illustrates example decision regions for N₁=6 and N₁=11 given external constellation points; and

FIG. 12 illustrates example decision regions in the first quadrant of a 64-QAM constellation.

NOTATION AND NOMENCLATURE

Certain terms are used throughout the following description and claims to refer to particular system components. As one skilled in the art will appreciate, computer companies may refer to a component by different names. This document doe not intend to distinguish between components that differ in name but not function. In the following discussion and in the claims, the terms “including” and “comprising” are used in an open-ended fashion, and thus should be interpreted to mean “including, but not limited to . . . .” Also, the term “couple” or “couples” is intended to mean either an indirect or direct electrical connection. Thus, if a first device couples to a second device, that connection may be through a direct electrical connection, or through an indirect electrical connection via other devices and connections. The term “system” refers to a collection of two or more hardware and/or software components, and may be used to refer to an electronic device or devices or a sub-system thereof. Further, the term “software” includes any executable code capable of running on a processor, regardless of the media used to store the software. Thus, code stored in non-volatile memory, and sometimes referred to as “embedded firmware,” is included within the definition of software.

DETAILED DESCRIPTION

It should be understood at the outset that although exemplary implementations of embodiments of the disclosure are illustrated below, embodiments may be implemented using any number of techniques, whether currently known or in existence. This disclosure should in no way be limited to the exemplary implementations, drawings, and techniques illustrated below, including the exemplary design and implementation illustrated and described herein, but may be modified within the scope of the appended claims along with their full scope of equivalents.

In light of the foregoing background, embodiments enable improved multiple-input multiple-output (MIMO) detection with a favorable performance-complexity trade-off compared to the Maximum-Likelihood (ML) detector and other existing MIMO detectors. For example, some embodiments for predicting the best leaf-nodes for a given channel and generating a candidate list are presented that are based on optimizing the probability that the channel input with lowest mean-squared error is among the candidate vectors enumerated. Embodiments more easily generate better parameter look-up tables by employing Leaf-Node Prediction (LNP) and by optimizing performance metrics. It will be appreciated by those skilled in the art, that a metric indicates whether a channel characteristic is good or bad for channel transmission, i.e., it is hard to perform detection correctly if a channel metric is bad or poor. For convenience, a parameter look-up table may sometimes be referred to simply as a look-up table. Moreover, embodiments of a LNP detector may be used as a way to generate a list of candidate vectors, or its list may be used to directly compute LLR values.

Although embodiments will be described for the sake of simplicity with respect to wireless communication systems, it should be appreciated that embodiments are not so limited, and can be employed in a variety of communication systems.

To better understand embodiments of this disclosure, it should be appreciated that the MIMO detection problem—namely, to recover the channel inputs given the channel outputs when there are multiple inputs and outputs—can be described using a narrowband channel model written as:

r=Ha+w,  (1)

where H is an M×N channel matrix, a is a signal vector such that a=[a₁ a₂ . . . a_(N)]^(T) is an N dimensional vector of symbols that may be drawn from different alphabets, and the noise has the autocorrelation matrix E[ww*]=Σ². Although the present discussion focuses on the case where Σ²=Iσ², it should be understood that embodiments are extendable to the more general case. For example, the channel outputs may be scaled so that the noise components have the same variance. The narrowband channel model can be applied to broadband channels when orthogonal frequency division multiplexing (OFDM) is used. In the OFDM case, each subcarrier is modeled according equation (1). Thus, the algorithms disclosed here can easily be extended to apply to broadband channels.

One way to implement a ML detector uses a QR decomposition (also known as a QR factorization) of the channel. This decomposition is defined as follows:

$\begin{matrix} \begin{matrix} {{\begin{bmatrix} H \\ {\alpha \; \hat{\sigma}\; I} \end{bmatrix}\Pi} = {\begin{bmatrix} Q \\ {\alpha \; \hat{\sigma}\; \Pi \; R^{- 1}} \end{bmatrix}R}} \\ {{= {\overset{\sim}{Q}R}},} \end{matrix} & (2) \end{matrix}$

where {tilde over (Q)} is an (M+N)×N matrix with orthonormal columns, R is an N×N triangular matrix with positive and real diagonals, Π is an N×N permutation matrix, {circumflex over (σ)} is an estimate of σ, and α is a chosen parameter. Although the present discussion describes embodiments assuming a lower triangular R matrix, it should be understood that embodiments can easily be extended to describe an upper triangular matrix instead. A common special case of the QR decomposition may be written as:

HΠ=QR,  (3)

when α=0.

The optimal value of the parameter α depends on the type of MIMO detector that is used. For example, and not by way of limitation, α=1 is optimal for a linear receiver because it minimizes the mean squared error (MSE), ∥R⁻¹Q^(H)y−s∥². On the other hand, α=0 is optimal for a ML receiver. It will be appreciated that in general the parameter α can take on any value.

A permutation matrix is an identity matrix after its columns have been permuted. The way the permutation matrix Π is selected impacts performance for some MIMO detectors. For example, and not by way of limitation, BLAST ordering chooses H to maximize the minimum diagonal of R. A less complex way to choose Π is the sorted-QR decomposition that attempts to maximize R_(1,1) (lower triangular R). Embodiments of LNP detection can work with any permutation matrix.

Thus, the MIMO detector problem can be simplified by creating an effective channel that is triangular. The process of creating an effective channel that is triangular is called MIMO equalization. One such method of triangularizing a channel uses the conjugate transpose of Q (resulting from the QR decomposition of the channel H) as follows:

y=Q ^(H) r=Rs+n  (4)

where s=Π⁻¹a=[s₁ s₂ . . . s_(N)]^(T) is a permutation of the channel input vector, n is an effective noise, and the superscript H denotes the conjugate transpose operation. Note that n may be a function of a when a≠0. The constellation for the i-th symbol is defined as s_(i)∈A_(i). The set containing all valid channel inputs is denoted as A₁ ^(N), this means s∈A₁ ^(N). The notation A₁ ^(N)(k,i,j) may be employed to denote the set of all valid channel inputs s whose j-th bit in the i-th symbol maps to the value k.

Other MIMO equalization techniques that do not use QR decomposition may also be used. For example, methods based on the Cholesky decomposition of H do not require the computation of Q. The Cholesky decomposition can compute R without computing Q. The equalization output in this case may be computed as:

y=R ⁻¹ H ^(H) r=Rs+n  (5)

The output of a ML detector is the log-likelihood ratio (LLR) of each bit transmitted in the vector s. The LLR value indicates the probability that a given bit was transmitted as a one or zero. The ML detector output for the j-th bit of the i-th symbol is described by a single equation:

λ_(i,j)=(∥r−HΠs ⁽⁰⁾∥² −∥r−HΠs ⁽¹⁾∥²)/{circumflex over (σ)}²,  (6)

where ∥r−HΠs^((k))∥² is minimized under the constraint that s^((k))∈A₁ ^(N)(k,i,j). It should be understood that this is only one example of how an LLR may be computed, and should not be used as a limitation on the embodiments disclosed or invention claimed. Also, the value ∥r−HΠx∥² is defined as the mean-squared error (MSE) of the vector x. The mean-squared error is one kind of cost that can be used for processing the signal.

The ML detector may also be defined using the equivalent triangular channel model:

λ_(i,j)=(∥y−Rs ⁽⁰⁾∥² −∥y−Rs ⁽¹⁾∥²)/{circumflex over (σ)}²,  (7)

where ∥y−Rs^((k))∥² is minimized subject to the constraints s^((k))∈A₁ ^(N)(k,i,j), and α=0, and where Π can be any permutation matrix. Note that ∥y−Rx∥²=∥r−HΠx∥² when α=0.

Many MIMO detectors are classified as list detectors. A list detector is any detector that generates a list of candidate vectors for the channel input. The set of candidate vectors is labeled as the set and the number of candidates in the set is called the list length L. The ML detector is a list detector with an exhaustive list. It is desirable for list detectors to generate their lists to be as small as possible without sacrificing too much performance. One example of a high-performing list detector is called the list-sphere detector. For a given channel realization, a list-sphere detector computes its list

such that each of the L candidate vectors it contains has a smaller MSE ∥r−HΠŝ∥² than any possible channel input outside the list

i.e. ∥r−HΠŝ∥²<∥r−HΠq∥² for any ŝ∈

and q∉

, where the i-th elements of ŝ and q belong to the constellation A_(i).

Given the set

generated by any list detector, the LLR for the j-th bit of the i-th symbol may be computed in a manner similar to the ML detector in equations (6) and (7):

λ_(i,j)=(∥y−Rs ⁽⁰⁾∥² −∥y−Rs ⁽¹⁾∥²)/{circumflex over (σ)}²,  (8)

where ∥y−Rs^((k))∥² is minimized subject to the constraints s^((k))∈A₁ ^(N)(k,i,j) and s^((k))∈

Therefore, minimizing the quantity ∥y−Râ∥² over a range of possible values for the vector â is an important challenge for MIMO detection. This detection challenge is directly related to the probability Pr[y|a=â], which can be fully described in terms of a tree search. The number of branches exiting the root node corresponds to the number of possible values for the first symbol. Likewise the number of branches exiting the nodes preceding the i-th level corresponds to the number of possibilities for the i-th symbol. In the end, there are

$\prod\limits_{i = 1}^{N}\; {A_{i}}$

total leaf nodes in the tree. The “cost” of any node is the sum of the scores of all the branches in the path back to the root node, where every branch in the tree is associated with a unique score. The score of a branch exiting a node at the i-th level can be written as:

Score=|z _(i) −R _(i,i) ŝ _(i)|²,

where z_(i) is the result of an interference cancellation procedure. The interference cancellation procedure is defined as:

$\begin{matrix} {{z_{i} = {y_{i} - {\sum\limits_{j = 1}^{i - 1}{R_{i,j}{\hat{s}}_{j}}}}},} & (9) \end{matrix}$

where y_(i) is defined by equation (4), and [ŝ₁ . . . ŝ_(i−1)]^(T) are the symbols from the path that connects the current branch back to the root node.

FIG. 1 shows an example tree diagram with two levels (N=2) and four branches exiting each node (alphabet A_(i) contains four elements). The branches illustrated were enumerated by an exemplary embodiment of a LNP detector that will be discussed later.

FIG. 2 is a block diagram of an exemplary communication system comprising a MIMO detector. Specifically, a wireless (e.g., radio frequency) stream of information is received at RF hardware 210, converted to a digital stream at analog-to-digital converter 220, and synchronized at 230. At this point the start of the packet has been located, and the digital stream is passed through a fast-Fourier transformation at FFT 240. The output of FFT 240 is provided to estimator 250 which estimates the noise variance of the stream. The outputs of FFT 240 and estimator 250 are provided to scaler 260 where the channel stream is preferably scaled using the noise variance estimation on the transformed stream, and separated into components. The outputs of scaler 260 are preferably fed to channel estimator 265 which estimates the H matrix. Scaler 260 forwards channel output, r, and channel estimator 265 forwards the estimated H matrix to MIMO detector 270. MIMO detector 270, which will be described as comprising a LNP detector for portions of this discussion, generates LLR values which are in turn provided to decoder 280 for analysis and/or further processing. The output of decoder 280 is stored in data sink 290 which can be any form of memory now known or later developed.

It will be appreciated that application of a low-complexity leaf-node predictor is motivated by the fact that a list-sphere detector has excellent performance even with very small L. Unfortunately, the list-sphere detector requires high complexity to generate even a small list. The implication is that for a given channel realization, if the receiver knew beforehand which L leaf nodes had minimum cost then the MIMO detection problem solves with very low complexity. This is the goal of embodiments of a leaf-node predictor. Thus, embodiments predict the best candidates for the channel inputs and disregard other possible channel inputs to reduce complexity.

An LNP detector 300, consistent with embodiments, comprises at least two elements as illustrated in FIG. 3; namely, leaf node predictor 310 and MIMO engine 320. Leaf node predictor 310 predicts the best leaf nodes for a given channel realization—this is also sometimes referred to in this disclosure as Leaf-Node Prediction. MIMO engine 320 enumerates and outputs the set of predicted leaf nodes along with their costs. As such embodiments may comprise a portion of a MIMO detector within a receiver (e.g., FIG. 2), or embodiments may be employed as a new variety of list detector to be used in any applicable system. Predicting the best leaf nodes for a given channel realization enables LNP detector 300 to approach the performance of the list-sphere detector, but with less complexity.

The accuracy of the leaf-node predictor is the key to achieving good performance in the LNP detector 300 and so it deserves a careful explanation. First, all the inputs into leaf-node predictor 310 preferably include the maximum number of leaf-nodes to be enumerated and an estimate of the channel matrix. The number of leaf nodes that LNP detector 300 enumerates is an input parameter called the list length, denoted as L. The channel matrix input depends on the kind of MIMO equalization that has been implemented. For example, a MIMO equalization may be used, one example of which is described in equation (4), in which case the matrix input to leaf-node predictor 310 may be the matrix R. However, if no MIMO equalization has been used or if a different kind of QR decomposition has been implemented by the MIMO equalizer, then the input to the leaf-node predictor is an estimate of the matrix H. The outputs of leaf-node predictor 310 are the two parameters N₁ and N ₂ to be used by the MIMO engine as described below. The parameter N₁ is the number of unique values of the first symbol represented in the list set of predicted best leaf nodes. The parameter N ₂=[N₂(1) N₂(2) . . . N₂(N₁)] represents the number of unique values of the second symbol there are for each unique value of the first symbol in the set of predicted best leaf nodes. In some embodiments each element in the vector are always equal, N₂(i)=N₂(j); in such case it is sufficient to represent N ₂ as a scalar, N ₂=N₂(1). For convenience, N ₂ may be referred to as a parameter in some portions of this disclosure, represented as a parameter scalar in other portions, and as a parameter vector in yet other portions of this disclosure. Ideally, leaf-node predictor 310 of LNP detector 300 outputs the parameters N₁ and N ₂ that yield the best performance under the constraint that

$L = {\sum\limits_{i = 1}^{N_{1}}\; {{N_{2}(i)}.}}$

This constraint is imposed by the input list length. It can be appreciated, that the list length impacts both the performance and complexity of LNP detector 300, and should be carefully chosen.

The job of leaf-node predictor 310 is to generate the parameters N₁ and N ₂ for a given list length and channel matrix. The goal of embodiments of the leaf-node predictor is to ensure that the actual channel input is one of the vectors in the output list

. Each of the two symbols s₁ and s₂ as defined in equation (4) has a different probability of causing an error—an error means that the actual channel input is not in the list

. Since an error can be caused when either symbol is wrong, minimizing the probability of an error means equalizing the probability that each symbol causes an error so that they are equally or approximately equally robust to errors. In channels where the first symbol is more prone to error, N₁ preferably should be larger because enumerating more values of the first symbol will make it more robust to errors. Leaf-node predictor 310 employs a channel metric generated from the channel matrix that measures the relative robustness to errors of the two symbols. Such a channel metric preferably indicates how many candidates for the first symbol are to be enumerated so that the resulting two symbols are equally robust to errors.

The channel metric is important to the leaf-node predictor 310. There are many possible channel metrics, but a preferable metric is a function of the diagonal elements of the R matrix from (2). Namely, the channel metric is preferably defined as:

$\begin{matrix} {{{h(H)} = \frac{R_{2,2}^{2}}{R_{1,1}^{2}}},} & (10) \end{matrix}$

but any function that has a one-to-one mapping with this ratio can also be used. For example R_(1,1)/R_(2,2), R_(2,2)/R_(1,1), or R_(1,1) ²/R_(2,2) ². A smaller value of R_(i,i) implies that the i-th symbol is more prone to errors. It will also be appreciated that a large value of h(H) implies that N₁ should be small, and a small value of h(H) implies that N₁ should be large when h(H) is defined as in equation (10). The channel metric (10) is shown to be a function of the channel matrix H through coefficients of the R matrix. When it comes to computing this channel metric, a QR decomposition is not necessary for all embodiments. For example, the channel metric may be computed directly as:

$\begin{matrix} {{{h(H)} = {\frac{{{\overset{\sim}{h}}_{2}}^{4}}{{{{\overset{\sim}{h}}_{2}}^{2}{{\overset{\sim}{h}}_{1}}^{2}} - {{{\overset{\sim}{h}}_{2}^{H}{\overset{\sim}{h}}_{1}}}^{2}} = \frac{R_{2,2}^{2}}{R_{1,1}^{2}}}},{{{where}\begin{bmatrix} {\overset{\sim}{h}}_{1} & {\overset{\sim}{h}}_{2} \end{bmatrix}} = {\begin{bmatrix} H \\ {\alpha \; \hat{\sigma}\; I} \end{bmatrix}\Pi}}} & (11) \end{matrix}$

or if α=0 is chosen then [{tilde over (h)}₁ {tilde over (h)}₂]=HΠ may be used instead.

Note that changing the parameters α, Π, or {circumflex over (σ)} of may also change this channel metric, which may be used to advantage. For example, by choosing the Π that minimizes or maximizes the value of h(H) the range of values of the channel metric stored in a parameter look-up table can be reduced.

Other alternative channel metrics are possible as well that are direct functions of H. Some examples are:

-   1. h(H)=ratio of eigenvalues of H. The eigenvalues can be computed,     for example and not by way of limitation, from the well-known     singular-value decomposition. -   2. h(H)=ratio of column norms of H.     Any channel metric currently in existence or developed in the future     may be employed by embodiments to implement the leaf-node predictor     310.

As illustrated in FIG. 4 a, if the appropriate decomposition of H has already been computed elsewhere in the receiver, the decomposition need not be recomputed in the leaf-node predictor; the matrix R can be an input to the leaf-node predictor. On the other hand, in some embodiments the leaf-node predictor can compute a different version of the decomposition than the one used by the MIMO equalizer. In that case, the matrix H and other parameters useful to computing the desired decomposition are input to leaf-node predictor 310. In either case, the same channel metric is generated in the end.

In alternative embodiments, when the leaf-node predictor is applied to different tones in an OFDM system, computing the channel metric for each individual tone may be avoided to reduce complexity. In this case, the channel metric is computed for some of the OFDM tones, then the channel metrics of the other tones are interpolated from the set of computed channel metrics. These embodiments, when compared with the embodiments of FIGS. 4 b and 6 b, would have {H_(k)}—as opposed to H—as input to the “Compute Channel Metric” block and as shown in FIGS. 4 b and 6 b, h(H_(k)) is output, where H_(k) is the channel matrix for the k-th tone, and {H_(k)} is the set of channel matrices for all tones.

For a given channel metric h(H) there are varying embodiments to implementing leaf-node predictor 310. Embodiments of one type try to mimic another MIMO detector that is known to give good performance; such embodiments will be discussed herein as simulator-based leaf-node predictors. Here the term “mimic” means to achieve the same or very similar performance as another MIMO detector while using a different and much less complex method—e.g., in the current discussion, LNP detection. Embodiments of another type compute, determine or generate the parameters N₁ and N ₂ directly for a given channel metric; such embodiments will be discussed herein as analytically-based leaf-node predictors.

Embodiments of simulation-based leaf-node prediction use a channel metric to mimic a MIMO detector that achieves satisfactory performance such as the list-sphere detector as illustrated in FIG. 5. Some embodiments achieve this by monitoring the MIMO detector over many channel realizations as it processes the data—this may be viewed as simulating the MIMO detector—and tracking the channel metric h(H) and the values of N₁ and N ₂ that the MIMO detector uses for each channel realization. The channel realizations may be generated from a mathematical model, or they could be recorded from an actual receiver. For an ideal channel metric, the values of the parameters N₁ and N ₂ are always the same for any two channels that have the same channel metric. However, one normally does not have a perfect channel metric; thus, a large set of simulations over many different channel realizations will yield a set of values {N₁ ^((t))} and {N ₂ ^((t))=[N₂ ^((t))(1) N₂ ^((t))(2) . . . N₂ ^((t))(N₁ ^((t)))]}—one set of the parameters N₁ and N ₂ for each channel realization. Therefore, from this large set of simulation results, the best values of N₁ and N ₂ used for a particular value of the channel metric are selected to populate a look-up table (illustrated as “Create Look-Up Table Entries” 520 in FIG. 5) and can be stored in a look-up table (“Store Look-Up Table Entries” 530). A different look-up table is created for each value of L—the system may restrict the possible values of L to a set of at least one value. In addition, if the channel metric is a function of the noise variance, then the simulations should also encompass a range of noise variance values, σ² and a different set of look-up tables will be generated for each value of the noise variance. If the channel metric is not a function of the noise variance, then noise variance is not used. The best values of N₁ and N ₂ may be determined in a number of ways as long as

$L = {\sum\limits_{i = 1}^{N_{1}}{{N_{2}(i)}.}}$

Some examples, and not by way of limitation, are:

-   1. N₁=mean{N₁ ^((t))} rounded to the nearest integer. And     N₂(i)=mean{N₂ ^((t))i)} rounded to the nearest integer. -   2. N₁=median{N₁ ^((t)))}. And N₂(i)=median{N₂ ^((t))(i)}. -   3. N₁=max{N₁ ^((t))} and N is the corresponding vector from {N ₂     ^((t))}.     It should be understood that simulator 510 preferably includes the     particular MIMO detector to be mimicked. It should also be     appreciated that such parameter look-up table creation is done     off-line and in advance, then stored in the receiver. When leaf-node     prediction subsequently occurs in the receiver, the channel metric     for the given channel is computed and matched to the nearest channel     metric stored in the parameter look-up table. Then the parameters N₁     and N ₂ associated with the stored channel metric value are fetched     and output by leaf-node predictor 310 (FIG. 4 a). Embodiments of     analytically-based leaf-node prediction analytically generate the     parameters N₁ and N ₂ directly from a given channel metric. To     better understand these embodiments, a mathematical basis for     computations will be discussed. After defining the computation of N₁     and N ₂ from the channel metric, embodiments of leaf-node predictor     310 may be implemented in at least two ways. In some embodiments,     the computation is used to construct a parameter look-up table that     is used according to embodiments illustrated in FIGS. 4 a and 4 b.     Such embodiments provide an easier way of constructing the look-up     table than the simulation-based embodiments. Other embodiments     compute, determine or generate N₁ and N ₂ in real-time for each     channel according to embodiments illustrated in FIGS. 6 a and 6 b.     In general, it will be appreciated, an algorithm that is only used     in advance to compute a look-up table may be more complex than an     algorithm to be executed in real-time.

Embodiments of simulator-based leaf-node predictors and some embodiments of analytically-based leaf-node predictors are implemented using a parameter look-up table that is stored in the receiver as illustrated in FIGS. 4 a and 4 b. On the other hand, some embodiments of analytically-based leaf-node predictors do not use any parameter look-up table at all as illustrated in FIGS. 6 a and 6 b.

To reduce the size of the look-up table it is possible to sparsely populate it. Specifically, that means that not all possible values of N₁ are represented in the look-up table. Then after computing the channel metric, the value of N₁ to be used is interpolated from the values of N₁ associated with the channel metrics that are stored in the look-up table. The values of N ₂ may be likewise interpolated.

Although there are many possible channel metrics, for simplicity's sake, embodiments will be discussed that preferably choose the parameters N₁ and N ₂ based on the probability that the list contains the channel input with lowest MSE. While this approach was selected in order to approximate a list-sphere detector, it should be appreciated that the channel metric may be otherwise selected. It has been found that the best MIMO engine inputs optimize P_(c), i.e., the probability that the list contains the channel input with lowest MSE. The vector with the smallest MSE is preferably referred to as s_(b), since it is the best estimate of the channel input, i.e. ∥r−HΠs_(b)∥²≦∥r−HΠq∥² for any q∈A₁ ^(N). This probability can be defined as:

P _(c) =Pr(s _(b)∈

),  (12)

where

is the set of candidate vectors output by MIMO engine 320 that corresponds to the set of leaf nodes output by leaf-node predictor 310. This probability metric definition can be rewritten as:

$P_{c} = {{\Pr \left( {{\overset{\_}{G}}_{1}\bigcup{\overset{\_}{G}}_{2}\bigcup\mspace{14mu} \ldots \mspace{14mu}\bigcup{\overset{\_}{G}}_{n_{1}}} \right)} = {\sum\limits_{i = 1}^{n_{1}}{\Pr \left( {\overset{\_}{G}}_{i} \right)}}}$

where G _(i) denotes the event that the i-th group of candidates contains s_(b), and all candidates in the i-th group have ŝ₁ ^((i)) as their first element. The summation holds because only one group of candidates can contain s_(b).

The following mathematical development is only to help, by example and not by way of limitation, in the derivation of at least some leaf-node prediction embodiments. To begin simplifying the probability metric equation, analyze the probability that the i-th group contains s_(b), in other words that it is “correct”. The i-th candidate for the first symbol, ŝ₁ ^((i)), is associated with N₂(i) unique values for the second symbol. The set of these unique values is called L_(i). According to this notation the i-th group is correct when ŝ₁ ^((i))=s₁ and s₂∈L_(i):

Pr( G _(i))=Pr(ŝ ₁ ^((i)) =s ₁ ∩s ₂ ∈L _(i)).

From Bayes' theorem this can be rewritten as:

Pr( G _(i))=Pr(ŝ ₁ ^((i)) =s ₁)Pr(s ₂ ∈L _(i) |ŝ ₁ ^((i)) =s ₁).

The first output of the whitened-matched filter, y₁ from equation (4), is a function of only the first channel input due to the lower triangular nature of the matrix R. In order to evaluate Pr(ŝ₁ ^((i))=s₁), y₁ is scaled to get signal plus noise:

${\overset{\sim}{y}}_{1} = {\frac{y_{1}}{R_{1,1}} = {{s_{1} + \frac{n_{1}}{R_{1,1}}} = {s_{1} + {{\overset{\sim}{n}}_{1}.}}}}$

The decision ŝ₁ ^((i)), is the i-th nearest symbol from the constellation to the point {tilde over (y)}₁. This means that Pr(ŝ₁ ^((i))=s₁) decreases monotonically as i increases. In words, ŝ₁ ^((i))=s₁ if {tilde over (y)}₁ lies outside the (i−1)-th decision region, but inside the i-th decision region. FIG. 12 illustrates the decision regions for i=1 and i=2 when s₁=3+j3 from the 64-QAM constellation. If {tilde over (y)}₁ lies within the inner square, then ŝ₁ ^((i))=s₁. If {tilde over (y)}₁ lies outside the inner square, but inside the outer square then ŝ₁ ⁽²⁾=s₁. Such decision regions can be drawn for all values of i, with each point in the 64-QAM constellation being the center. In general the following equation applies:

${{\Pr \left( {{\hat{s}}_{1}^{(i)} = s_{1}} \right)} = {\sum\limits_{x \in A_{i}}{{\Pr \left( {{\hat{s}}_{1}^{(i)} = {{s_{1}s_{1}} = x}} \right)}{\Pr \left( {s_{1} = x} \right)}}}},$

where A_(i) may be any symbol constellation. Since all points in a constellation are equally likely to be transmitted the equation is reduced to:

${\Pr \left( {{\hat{s}}_{1}^{(i)} = s_{1}} \right)} = {\frac{1}{A_{1}}{\sum\limits_{s \in A_{1}}{{\Pr \left( {{\hat{s}}_{1}^{(i)} = {{s_{1}s_{1}} = s}} \right)}.}}}$

However, the value of Pr(ŝ₁ ^((i))=s₁|s₁=x) depends not only on the value of i, but also on where s₁ is located in the constellation. In fact, the shapes of the decision regions change only when they would extend beyond the boundaries of the constellation.

The probability distribution of {tilde over (y)}₁ given that s₁ is transmitted is denoted as f_({tilde over (y)}) ₁ _(|s) ₁ (x). Assuming additive white Gaussian noise, f_({tilde over (y)}) ₁ _(|s) ₁ (x) is a two-dimensional Gaussian function with mean s₁ and variance

$\frac{\sigma^{2}}{R_{1,1}^{2}}.$

The value of Pr(ŝ₁ ^((i))=s₁) may be computed from

${\sum\limits_{k = 1}^{i}{\Pr \left( {{\hat{s}}_{1}^{(k)} = s_{1}} \right)}},$

which is the integral of f_({tilde over (y)}) ₁ _(|s) ₁ (x) within the bounds of the border of the i-th decision region—the integral over this region produces a volume. The average value of this volume over all possible transmitted symbols is written as:

${v_{1}\left( {i,{\sigma/R_{1,1}}} \right)} = {\sum\limits_{k = 1}^{i}{{\Pr \left( {{\hat{s}}_{1}^{(k)} = s_{1}} \right)}.}}$

The probability that ŝ₁ ^((i)) is correct can be expressed as a differential volume:

Pr(ŝ ₁ ^((i)) =s ₁)=v ₁(i,σ/R _(1,1))−v ₁(i−1,σ/R _(1,1)),

where v₁(0,x)=0 for any x. To obtain a similar expression for the second symbol, the interference from the first symbol in the second output of the whitened-matched filter equation (4) can be cancelled to obtain:

${\overset{\sim}{y}}_{2}^{(i)} = \frac{y_{2} - {R_{2,1}{\hat{s}}_{1}^{(i)}}}{R_{2,2}}$ ${\overset{\sim}{y}}_{2}^{(i)} = {a_{2} + {\frac{R_{2,1}}{R_{{2,2}\;}}\left( {s_{1} - {\hat{s}}_{1}^{(i)}} \right)} + {\frac{n_{2}}{R_{2,2}}.}}$

If ŝ₁ ^((i))=s₁ this reduces to:

{tilde over (y)} ₂ ^((i)) =s ₂ +ñ ₂.

Therefore, the probability Pr(s₂∈L_(i)|Iiŝ₁ ^((i))=s₁) can also be computed as an average volume:

${v_{2}\left( {{\hat{s}}_{1}^{(i)},{N_{2}(i)},{\sigma/R_{2,2}}} \right)} = {\sum\limits_{k = 1}^{N_{2}{(i)}}{{\Pr \left( {{\hat{s}}_{2}^{(k)} = {\left. s_{2} \middle| {\hat{s}}_{1}^{(i)} \right. = s_{1}}} \right)}.}}$

The probability that the i-th group is correct is written as a function of these volume functions as follows:

Pr( G _(i))=[v ₁(i,σ/R _(1,1))−v ₁(i−1,σ/R _(1,1))]v ₂(ŝ ₁ ^((i)) ,i,σ/R _(2,2)).

This leads to a more useful expression of the probability metric equation (12):

$\begin{matrix} {P_{c} = {\sum\limits_{i = 1}^{N_{1}}{\Pr \left( {\overset{\_}{G}}_{i} \right)}}} \\ {= {\sum\limits_{i = 1}^{N_{1}}{\left\lbrack {{v_{1}\left( {i,{\sigma/R_{1,1}}} \right)} - {v_{1}\left( {{i - 1},{\sigma/R_{1,1}}} \right)}} \right\rbrack {{v_{2}\left( {{\hat{s}}_{1}^{(i)},i,{\sigma/R_{2,2}}} \right)}.}}}} \end{matrix}$

Understanding the probability metric equation involves understanding how to evaluate the volume functions v₁(N₁,σ/R_(1,1)) and v₂(ŝ₁ ^((i)),N₂(i),σ/R_(2,2)). These volume functions are closely related to the shape of the decision regions. FIG. 10 shows two example decision regions (the shaded areas) when ŝ₁ ^((i))=1+j. FIG. 10 illustrates that increasing N₁ from 6 to 11 basically increases the minimum distance from the decision region's center to its boundary from 2.51 to 3.17, this minimum distance D_(min)(N₁) is labeled. One approximation of the decision region is a circle with radius D_(min)(N₁) centered at ŝ₁ ^((i)), also illustrated in FIG. 10. The value of D_(min)(N₁) depends on where ŝ₁ ^((i)) lies in the constellation. FIG. 11 shows how edge effects impact the decision region when ŝ₁ ^((i))=7+j7. Note that D_(min)(|A₁|)=∞ since the decision region includes the entire constellation in this case.

Using the circular decision region approximation, the volume given a particular point in the constellation is written as:

${v_{1}\left( {N_{1},{\sigma/R_{1,1}}} \right)} = {\int_{- {D_{m\; i\; n}{(N_{1})}}}^{D_{m\; i\; n}{(N_{1})}}{\int_{- {D_{m\; i\; n}{(N_{1})}}}^{D_{m\; i\; n}{(N_{1})}}{\frac{R_{1,1}^{2}}{2\pi \; \sigma^{2}}{\exp\left( \frac{{- \left( {x^{2} + y^{2}} \right)}R_{1,1}^{2}}{2\; \sigma^{2}} \right)}{x}{{y}.}}}}$

After simple substitutions, the volume can be written as:

${v_{1}\left( {N_{1},{\sigma/R_{1,1}}} \right)} = {\int_{{- R_{1,1}} \cdot {D_{m\; i\; n}{(N_{1})}}}^{R_{1,1} \cdot {D_{m\; i\; n}{(N_{1})}}}{\int_{{- R_{1,1}} \cdot {D_{\; {m\; i\; n}}{(N_{1})}}}^{R_{1,1} \cdot {D_{\; {m\; i\; n}}{(N_{1})}}}{\frac{1}{2\pi \; \sigma^{2}}{\exp\left( \frac{- \left( {x^{2} + y^{2}} \right)}{2\sigma^{2}} \right)}{x}{{y}.}}}}$

A similar expression can be derived for v₂(ŝ₁ ^((i))N₂(i),σ/R_(2,2)).

The circular approximation provides some insight into how to approximate the volume function. The two integrals of the volume function are separable:

${v_{1}\left( {N_{1},{\sigma/R_{1,1}}} \right)} = {\int_{{- R_{1,1}} \cdot {D_{\; {m\; i\; n}}{(N_{1})}}}^{R_{1,1} \cdot {D_{m\; i\; n}{(N_{1})}}}{\frac{1}{\sqrt{2\pi \; \sigma^{2}}}{\exp\left( \frac{- x^{2}}{2\sigma^{2}} \right)}{x}}}$ $\int_{{- R_{1,1}} \cdot {D_{\; {m\; i\; n}}{(N_{1})}}}^{R_{1,1} \cdot {D_{\; {m\; i\; n}}{(N_{1})}}}{\frac{1}{\sqrt{2\pi \; \sigma^{2}}}{\exp\left( \frac{- y^{2}}{2\sigma^{2}} \right)}{{y}.}}$

Furthermore, the volume function can be related to the Q function:

${v_{1}\left( {N_{1},{\sigma/R_{1,1}}} \right)} = {\int_{{- R_{1,1}} \cdot {{D_{\; {m\; i\; n}}{(N_{1})}}/\sigma}}^{{R_{1,1} \cdot D_{m\; i\; n}}\; {{(N_{1})}/\sigma}}{\frac{1}{\sqrt{2\pi}}{\exp \left( {{- x^{2}}/2} \right)}{x}}}$ $\int_{{- R_{1,1}} \cdot {D_{\; {m\; i\; n}}/\sigma}}^{R_{1,1} \cdot {{D_{\; {m\; i\; n}}{(N_{1})}}/\sigma}}{\frac{1}{\sqrt{2\pi}}{\exp \left( {{- y^{2}}/2} \right)}{y}}$ v₁(N₁, σ/R_(1, 1)) = (1 − 2 Q(R_(1, 1) ⋅ D_( m i n)(N₁)/σ))².

A common approximation of the Q function follows from the Chernoff bound:

${Q(x)} = {{\frac{1}{\sqrt{2\pi}}{\int_{x}^{\infty}{{\exp \left( {{- x^{2}}/2} \right)}{x}}}} \approx {\frac{1}{2}{{\exp \left( {{- x^{2}}/2} \right)}.}}}$

Using this approximation, the volume function can be expressed as:

${v_{1}\left( {N_{1},{\sigma/R_{1,1}}} \right)} \approx {1 - {\exp \left( {{- \left( {R_{1,1} \cdot {{D_{m\; i\; n}\left( N_{1} \right)}/\sigma}} \right)^{2}}/2} \right)} + {\frac{1}{4}{{\exp \left( {- \left( {R_{1,1} \cdot {{D_{m\; i\; n}\left( N_{1} \right)}/\sigma}} \right)^{2}} \right)}.}}}$

Applying the max-log approximation on top of the Chernoff approximation yields:

v_(i)(N₁,σ/R_(1,1))≈1−exp(−(R_(1,1)·D_(min)(N₁))²/2σ²).

Similarly, the second volume function is approximated as:

v₂(ŝ₁ ^((i)),N₂(i),σ/R_(2,2))≈1−exp(−(R_(2,2)·D_(min)(N₂(i)))²/2σ²).

It should be understood that the above mathematical derivations are provided as an example, and not by way of limitation, of one way to arrive at an approximate equation for the desired or predetermined probability metric. From the above derivations of the volume functions, one approximation of P_(c) can be written as:

$\begin{matrix} {{{P_{c} \approx {\overset{\sim}{P}}_{c}} = {\sum\limits_{i = 1}^{N_{1}}{\begin{bmatrix} {\left( {1 - {\exp\left( \frac{- \left( {R_{1,1} \cdot {D_{m\; i\; n}(i)}} \right)^{2}}{2\sigma^{2}} \right)}} \right) -} \\ \left( {1 - {\exp\left( \frac{- \left( {R_{1,1} \cdot {D_{m\; i\; n}\left( {i - 1} \right)}} \right)^{2}}{2\sigma^{2}} \right)}} \right) \end{bmatrix}\left( {1 - {\exp\left( \frac{- \left( {R_{2,2} \cdot {D_{m\; i\; n}\left( {N_{2}(i)} \right)}} \right)^{2}}{2\sigma^{2}} \right)}} \right)}}},} & (13) \end{matrix}$

where D_(min)(i) is half the minimum distance separating two neighboring points in the symbol alphabet, and D_(min)(0)=0. FIG. 7 illustrates the numerical values of the function D_(min)(N₁), in the context of 64-QAM (quadrature amplitude modulation), and the fact that D_(min)(N₁)=√{square root over (N₁)} is a reasonable approximation. For ease of discussion, the following variable substitution is employed:

$\begin{matrix} {{\theta \left( {k,i} \right)} = {\frac{\left( {R_{k,k} \cdot {D_{m\; i\; n}(i)}} \right)^{2}}{2\sigma^{2}}.}} & (14) \end{matrix}$

With this substitution, equation (13) becomes:

$\begin{matrix} {{\overset{\sim}{P}}_{c} = {\sum\limits_{i = 1}^{N_{1}}{\begin{bmatrix} {\left( {1 - {\exp \left( {- {\theta \left( {1,i} \right)}} \right)}} \right) -} \\ \left( {1 - {\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)}} \right) \end{bmatrix}\left\lbrack {1 - {\exp \left( {- {\theta \left( {2,{N_{2}(i)}} \right)}} \right)}} \right\rbrack}}} & (15) \end{matrix}$

Some embodiments do an exhaustive search over all possible values of N₁ and N ₂ that obey the constraint

${\sum\limits_{i = 1}^{N_{1}}{N_{2}\; (i)}} \leq {L.}$

The result of such embodiments of an exhaustive leaf-node predictor is the set of parameters that optimize {tilde over (P)}_(c) as computed according to equation (13). Specifically, as shown in equation (13) {tilde over (P)}_(c) is a function of N₁, N ₂, R_(1,1), R_(2,2), and σ². The values of R_(1,1), R_(2,2), and σ² are known for the given channel realization, then the parameters N₁ and N ₂ that optimize {tilde over (P)}_(c) are the output of leaf-node predictor 310. Due to the high complexity, it is more practical to implement most embodiments of analytically-based leaf-node prediction off-line in advance to compute or generate a look-up table. When performed in advance, the parameters N₁ and N ₂ that optimize {tilde over (P)}_(c) are preferably stored in a look-up table along with h(H) and σ² for a range of values of R_(1,1), R_(2,2), and σ². In practice, the range of values included in the search may comprise only one unique value σ² such as the reciprocal of the nominal operating signal-to-noise ratio (SNR).

At least some embodiments, such as that illustrated in FIG. 8, choose the parameters N₁ and N ₂ to optimize {tilde over (P)}_(c) by beginning with N ₂=[1, 0, 0, . . . 0] (block 810), and then iteratively increasing the element N₂(i) that most increases or improves {tilde over (P)}_(c) until

$L = {\sum\limits_{i = 1}^{N_{1}}{{N_{2}(i)}{\left( {{{blocks}\mspace{14mu} 820} - 860} \right).}}}$

In terms of performance, it is preferred to increase the elements N₂(i) by only one each time, although it should be understood that by incrementing or increasing by more than one in some embodiments may decrease complexity with an acceptable performance loss. It should be understood that in case of a tie between indices, preferably the smaller index is selected. Note that N₁ is the number of non-zero values in N ₂. Such embodiments can be implemented by independently considering the terms of the summation in equation (15):

$\begin{matrix} {{{\overset{\sim}{P}}_{c} = {\sum\limits_{i = 1}^{N_{1}}M_{i}}},{{where}\text{:}}} & (16) \\ {M_{i} = \left\{ \begin{matrix} {\left\lbrack {1 - {\exp \left( {- {\theta \left( {1,1} \right)}} \right)}} \right\rbrack \left\lbrack {1 - {\exp \left( {- {\theta \left( {2,{N_{2}(1)}} \right)}} \right)}} \right\rbrack} & {{{if}\mspace{14mu} i} = 1} \\ \begin{matrix} \left\lbrack {{\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} - {\exp \left( {- {\theta \left( {1,i} \right)}} \right)}} \right\rbrack \\ \left\lbrack {1 - {\exp \left( {- {\theta \left( {2,{N_{2}(i)}} \right)}} \right)}} \right\rbrack \end{matrix} & {{{if}\mspace{14mu} i} > 1.} \end{matrix} \right.} & (17) \end{matrix}$

Incrementing N₂(i) would cause the i-th term to increase according to:

$\begin{matrix} {{\overset{\sim}{M}}_{i} = \left\{ \begin{matrix} \begin{matrix} \left\lbrack {1 - {\exp \left( {- {\theta \left( {1,1} \right)}} \right)}} \right\rbrack \\ \left\lbrack {1 - {\exp \left( {- {\theta \left( {2,{{N_{2}(1)} + 1}} \right)}} \right)}} \right\rbrack \end{matrix} & {{{if}\mspace{14mu} i} = 1} \\ \begin{matrix} \left\lbrack {{\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} - {\exp \left( {- {\theta \left( {1,i} \right)}} \right)}} \right\rbrack \\ \left\lbrack {1 - {\exp \left( {- {\theta \left( {2,{{N_{2}(i)} + 1}} \right)}} \right)}} \right\rbrack \end{matrix} & {{{if}\mspace{14mu} i} > 1.} \end{matrix} \right.} & (18) \end{matrix}$

Thus, the increase in {tilde over (P)}_(c) caused by incrementing N₂(i) is {tilde over (M)}_(i)−M_(i). Next, find the element of N ₂ whose increase would cause the greatest increase to {tilde over (P)}_(c):

n=argmax_(i=1 . . . (N) ₁ ₊₁₎({tilde over (M)} _(i) −M _(i)).  (19)

Element N₂(n) is incremented (block 830), and N₁ is also incremented if n=N₁+1 (blocks 840 and 850). The process is continued until

$L = {\sum\limits_{i = 1}^{N_{1}}{{N_{2}(i)}.}}$

FIG. 8 is a diagram of an embodiment of this analytically-based leaf-node prediction method. Initially, the number of elements in N ₂ is the maximum possible value of N₁, which is preferably not greater than the size of the first symbol's constellation; some of the elements in N ₂ may remain zero once

$L = {\sum\limits_{i = 1}^{N_{1}}{{N_{2}(i)}.}}$

Alternatively, the number of elements stored in N ₂ may be dynamic, then initially there would be only two elements, N ₂=[1,0]. In such alternative embodiments, when n is greater than N₁ (block 840) a new zero element is added to N ₂, N₂(n)=0.

If the leaf-node prediction algorithm is to be implemented in real-time, then it is desirable to reduce the complexity of computing equation (19). Discussion will now turn to the computation of {tilde over (M)}_(i)−M_(i), and how to compute this difference term with less complexity. This difference term can be expressed as:

$\begin{matrix} {{{\overset{\sim}{M}}_{i} - M_{i}} = \left\{ \begin{matrix} \begin{matrix} {\left\lbrack {1 - {\exp \left( {- {\theta \left( {1,1} \right)}} \right)}} \right\rbrack \cdot} \\ \begin{bmatrix} {{\exp \left( {- {\theta \left( {2,{N_{2}(1)}} \right)}} \right)} -} \\ {\exp \left( {- {\theta \left( {2,{{N_{2}(1)} + 1}} \right)}} \right)} \end{bmatrix} \end{matrix} & {{{if}\mspace{14mu} i} = 1} \\ \begin{matrix} {\left\lbrack {{\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} - {\exp \left( {- {\theta \left( {1,i} \right)}} \right)}} \right\rbrack \cdot} \\ \left\lbrack {1 - {\exp \left( {- {\theta \left( {2,1} \right)}} \right)}} \right\rbrack \end{matrix} & {{{if}\mspace{14mu} i} = {N_{1} + 1}} \\ \begin{matrix} {\left\lbrack {{\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} - {\exp \left( {- {\theta \left( {1,i} \right)}} \right)}} \right\rbrack \cdot} \\ \left\lbrack {{\exp \left( {- {\theta \left( {2,{N_{2}(i)}} \right)}} \right)} - {\exp \left( {- {\theta \left( {2,{{N_{2}(i)} + 1}} \right)}} \right)}} \right\rbrack \end{matrix} & {{else}.} \end{matrix} \right.} & (20) \end{matrix}$

These expressions can be complex to compute due to the exponential functions, but there are approximations for the exponential operation that can reduce complexity. An exemplary embodiment, which has been found to provide significant reduction in complexity while resulting in little, if any, performance degradation, is described below.

Some embodiments use a Max-Log approximation e^(−a)−e^(−b)≅e^(−min(a,b)) to simplify the computation of equation (20) and (19):

$\begin{matrix} {{{\overset{\sim}{M}}_{i} - M_{i}} \cong \left\{ \begin{matrix} \begin{matrix} {\left\lbrack {1 - {\exp \left( {- {\theta \left( {1,1} \right)}} \right)}} \right\rbrack \cdot} \\ {\exp \left( {- {\theta \left( {2,{N_{2}(1)}} \right)}} \right)} \end{matrix} & {{{if}\mspace{14mu} i} = 1} \\ \begin{matrix} {{\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} \cdot} \\ \left\lbrack {1 - {\exp \left( {- {\theta \left( {2,1} \right)}} \right)}} \right\rbrack \end{matrix} & {{{if}\mspace{14mu} i} = {N_{1} + 1}} \\ \begin{matrix} {{\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} \cdot} \\ {\exp \left( {- {\theta \left( {2,{N_{2}(i)}} \right)}} \right)} \end{matrix} & {{else}.} \end{matrix} \right.} & (21) \end{matrix}$

By approximating 1−exp(−x) as 1, the expression simplifies further:

$\begin{matrix} {{{\overset{\sim}{M}}_{i} - M_{i}} \cong \left\{ \begin{matrix} {\exp \left( {- {\theta \left( {2,{N_{2}(1)}} \right)}} \right)} & {{{if}\mspace{14mu} i} = 1} \\ {\exp \left( {- {\theta \left( {1,{i - 1}} \right)}} \right)} & {{{if}\mspace{14mu} i} = {N_{1} + 1}} \\ {\exp \left( {{- {\theta \left( {1,{i - 1}} \right)}} - {\theta \left( {2,{N_{2}(i)}} \right)}} \right)} & {{else}.} \end{matrix} \right.} & (22) \end{matrix}$

Using this result, the index of the maximum {tilde over (M)}_(i)−M_(i) as defined by equation (19), can be found without the exponential computations according to:

$\begin{matrix} \begin{matrix} {n = {\arg \; {\max_{i = {1\mspace{11mu} \ldots \mspace{14mu} {({N_{1} + 1})}}}\left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)}}} \\ {= {\arg \; {\max_{i = {1\mspace{11mu} \ldots \mspace{14mu} {({N_{1} + 1})}}}{\log \left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)}}}} \\ {= {\arg \; {\min_{i = {1\mspace{11mu} \ldots \mspace{14mu} {({N_{1} + 1})}}}{- {\log \left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)}}}}} \\ {= {\arg \; \min_{i = {1\mspace{11mu} \ldots \mspace{14mu} {({N_{1} + 1})}}}}} \\ {\left( {{\theta \left( {2,{N_{2}(1)}} \right)},\begin{Bmatrix} {{\theta \left( {1,{i - 1}} \right)} -} \\ {\theta \left( {2,{N_{2}(i)}} \right)} \end{Bmatrix}_{i = {2\mspace{11mu} \ldots \mspace{14mu} N_{1}}},{\theta \left( {1,N_{1}} \right)}} \right)} \\ {\cong {\arg \; {\min \begin{pmatrix} \begin{matrix} {{R_{2,2}^{2} \cdot {D_{\min}^{2}\left( {N_{2}(1)} \right)}},} \\ {\left\{ {{R_{2,2}^{2} \cdot {D_{\min}^{2}\left( {N_{2}(i)} \right)}} + {R_{1,1}^{2} \cdot {D_{\min}^{2}\left( {i - 1} \right)}}} \right\}_{i = {2\mspace{11mu} \ldots \mspace{14mu} N_{1}}},} \end{matrix} \\ {R_{1,1}^{2} \cdot {D_{\min}^{2}\left( N_{1} \right)}} \end{pmatrix}}}} \\ {= {\arg \; {\min \begin{pmatrix} \begin{matrix} {{\frac{R_{2,2}^{2}}{R_{1,1}^{2}} \cdot {D_{\min}^{2}\left( {N_{2}(1)} \right)}},} \\ {\left\{ {{\frac{R_{2,2}^{2}}{R_{1,1}^{2}} \cdot {D_{\min}^{2}\left( {N_{2}(i)} \right)}} + {\cdot {D_{\min}^{2}\left( {i - 1} \right)}}} \right\}_{i = {2\mspace{11mu} \ldots \mspace{14mu} N_{1}}},} \end{matrix} \\ {D_{\min}^{2}\left( N_{1} \right)} \end{pmatrix}}}} \end{matrix} & (23) \end{matrix}$

Equation (20) shows that the only impact that the channel has on choosing the parameters N₁ and N ₂ is through the quantity h(H)=R₂ ^(2,2)/R_(1,1) ². This implies that R₂ ^(2,2)/R_(1,1) ² is a good channel metric for embodiments of leaf-node predictor 310. It will be appreciated that other functions with a one-to-one mapping with R₂ ^(2,2)/R_(1,1) ² can also be used as the channel metric. Another reason why this simplification reduces complexity is that equation (20) is independent of σ.

Since the parameters chosen by the embodiment illustrated in FIG. 8 using equation (23) will be the same for all channel realizations that have the same value of h(H), such embodiment could additionally or alternatively be used to generate a look-up table for a range of values of h(H). Then during operation, MIMO detector 300 extracts the parameters corresponding to the value of h(H) for each channel realization. In this case, the noise variance is not used for generating the look-up table.

Some embodiments use a first-order Taylor series expansion to simplify the computation of equation (21); approximating the exponential function as e^(−x)≅1−x yields:

$\begin{matrix} {{T\left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)} = \left\{ \begin{matrix} {{\theta \left( {1,1} \right)}\begin{bmatrix} {{\theta \left( {2,{{N_{2}(1)} + 1}} \right)} -} \\ {\theta \left( {2,{N_{2}(1)}} \right)} \end{bmatrix}} & {{{if}\mspace{14mu} i} = 1} \\ {\left\lbrack {{\theta \left( {1,i} \right)} - {\theta \left( {1,{i - 1}} \right)}} \right\rbrack {\theta \left( {2,1} \right)}} & {{{if}\mspace{14mu} i} = {N_{1} + 1}} \\ \begin{matrix} \left\lbrack {{\theta \left( {1,i} \right)} - {\theta \left( {1,{i - 1}} \right)}} \right\rbrack \\ \left\lbrack {{\theta \left( {2,{{N_{2}(i)} + 1}} \right)} - {\theta \left( {2,{N_{2}(i)}} \right)}} \right\rbrack \end{matrix} & {{else}.} \end{matrix} \right.} & (24) \end{matrix}$

Higher-order Taylor series expansions may also be used to improve the approximation, but it has been observed that such improvement comes at the cost of increasing complexity. For constructing a look-up table off-line where complexity is of little concern this is an attractive option. Substituting for θ(k,i) and factoring out common factors to the left-hand side yields:

$\begin{matrix} {{\left( {2\; \sigma} \right)^{2} \cdot {T\left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)}} = \left\{ \begin{matrix} \begin{matrix} \left( {R_{1,1} \cdot {D_{\min}(1)}} \right)^{2} \\ \begin{bmatrix} {\left( {R_{2,2} \cdot {D_{\min}\left( {{N_{2}(1)} + 1} \right)}} \right)^{2} -} \\ \left( {R_{2,2} \cdot {D_{\min}\left( {N_{2}(1)} \right)}} \right)^{2} \end{bmatrix} \end{matrix} & {{{if}\mspace{14mu} i} = 1} \\ \begin{matrix} \begin{bmatrix} {\left( {R_{1,1} \cdot {D_{\min}(i)}} \right)^{2} -} \\ \left( {R_{1,1} \cdot {D_{\min}\left( {i - 1} \right)}} \right)^{2} \end{bmatrix} \\ \left( {R_{2,2} \cdot {D_{\min}(1)}} \right)^{2} \end{matrix} & {{{if}\mspace{14mu} i} = {N_{1} + 1}} \\ \begin{matrix} \begin{bmatrix} {\left( {R_{1,1} \cdot {D_{\min}(i)}} \right)^{2} -} \\ \left( {R_{1,1} \cdot {D_{\min}\left( {i - 1} \right)}} \right)^{2} \end{bmatrix} \\ \begin{bmatrix} {\left( {R_{2,2} \cdot {D_{\min}\left( {{N_{2}(i)} + 1} \right)}} \right)^{2} -} \\ \left( {R_{2,2} \cdot {D_{\min}\left( {N_{2}(i)} \right)}} \right)^{2} \end{bmatrix} \end{matrix} & {{else}.} \end{matrix} \right.} & (25) \end{matrix}$

Factoring the term R_(1,1) ²·R_(2,2) ² to the left-hand side and substituting D_(min)(1)=1 yields:

$\begin{matrix} \begin{matrix} {{\overset{\sim}{T}\left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)} = {{T\left( {{\overset{\sim}{M}}_{i} - M_{i}} \right)}\frac{\left( {2\; \sigma^{2}} \right)^{2}}{R_{1,1}^{2} \cdot R_{2,2}^{2}}}} \\ {= \left\{ \begin{matrix} {{D_{\min}^{2}\left( {{N_{2}(1)} + 1} \right)} - {D_{\min}^{2}\left( {N_{2}(1)} \right)}} & {{{if}\mspace{14mu} i} = 1} \\ {{D_{\min}^{2}\left( {N_{1} + 1} \right)} - {D_{\min}^{2}\left( N_{1} \right)}} & {{{if}\mspace{14mu} i} = {N_{1} + 1}} \\ \begin{matrix} {\left\lbrack {{D_{\min}^{2}(i)} - {D_{\min}^{2}\left( {i - 1} \right)}} \right\rbrack \cdot} \\ \left\lbrack {{D_{\min}^{2}\left( {{N_{2}(i)} + 1} \right)} - {D_{\min}^{2}\left( {N_{2}(i)} \right)}} \right\rbrack \end{matrix} & {{else}.} \end{matrix} \right.} \end{matrix} & (26) \end{matrix}$

Embodiments employing a Taylor-series approximation have the interesting result that they always generate the same parameters N₁ and N ₂ regardless of the channel realization.

Using the first-order Taylor series expansion to compute equation (19) is mathematically summarized as:

n=argmax_(i=1 . . . (N) ₁ ₊₁₎({tilde over (M)} _(i) −M _(i))

≈argmax_(i=1 . . . (N) ₁ ₊₁₎ {tilde over (T)}({tilde over (M)} _(i) −M _(i)).  (27)

Another leaf-node predictor embodiment chooses the parameters N₁ and N ₂ to optimize {tilde over (P)}_(c) in a different way. By assuming that all elements in N ₂ are uniform or equal, N₂(i)=N₂, equation (13) simplifies to:

$\begin{matrix} \begin{matrix} {{\overset{\sim}{P}}_{c} = \left( {1 - {\exp \left( \frac{- \left( {R_{2,2} \cdot {D_{\min}\left( N_{2} \right)}} \right)^{2}}{2\sigma^{2}} \right)}} \right)} \\ {{\sum\limits_{i = 1}^{N_{1}}\left\lbrack {\left( {1 - {\exp \left( \frac{- \left( {R_{1,1} \cdot {D_{\min}(i)}} \right)^{2}}{2\sigma^{2}} \right)}} \right) -} \right.}} \\ \left. \left( {1 - {\exp \left( \frac{- \left( {R_{1,1} \cdot {D_{\min}\left( {i - 1} \right)}} \right)^{2}}{2\sigma^{2}} \right)}} \right) \right\rbrack \\ {= \left( {1 - {\exp \left( \frac{- \left( {R_{2,2} \cdot {D_{\min}\left( N_{2} \right)}} \right)^{2}}{2\sigma^{2}} \right)}} \right)} \\ {{\left( {1 - {\exp \left( \frac{- \left( {R_{1,1} \cdot {D_{\min}\left( N_{1} \right)}} \right)^{2}}{2\sigma^{2}} \right)}} \right).}} \end{matrix} & (28) \end{matrix}$

The list length in these embodiments is L=N₁·N₂, so N₁ increases when N₂ decreases and vice versa. As a result, {tilde over (P)}_(c) is maximum when R_(2,2)·D_(min)(N₂)=R_(1,1)·D_(min)(N₁). Substituting N₂=L/N₁ into this equation yields a simple equation for N₁, namely:

$\begin{matrix} \begin{matrix} {N_{1} = {D_{\min}^{- 1}\left( {\frac{R_{2,2}}{R_{1,1}} \cdot {D_{\min}\left( \frac{L}{N_{1}} \right)}} \right)}} \\ {\cong \left( {\frac{R_{2,2}}{R_{1,1}} \cdot \sqrt{\frac{L}{N_{1}}}} \right)^{2}} \\ {= {\left( \frac{R_{2,2}}{R_{1,1}} \right)^{2}\frac{L}{N_{1}}}} \end{matrix} & (29) \end{matrix}$

where D_(min)(x)≅√{square root over (x)} is employed. This gives a simple equation for generating N₁ for a given channel realization:

$\begin{matrix} {N_{1} = {\frac{R_{2,2}}{R_{1,1}}{\sqrt{L}.}}} & (30) \end{matrix}$

Equation (30) is preferably not used as is, because N₁ should be an integer less than or equal to the list length. The maximum size of N₁ may also be restricted as follows:

$\begin{matrix} {{N_{1} = {\min \left( {\left\lceil {\frac{R_{2,2}}{R_{1,1}}\sqrt{L}} \right\rceil,{N_{1,\max}(L)}} \right)}},} & (31) \end{matrix}$

so that N₁≦N_(1,max)(L) is certain, and where ┌x┐ is the integer closest to x that is also greater than or equal to x. The specific value of N_(1,max) (L) may be chosen to achieve a favorable performance-complexity trade-off, as long as N_(1,max)(L)≦|A₁|. Once N₁ has been computed or generated, then the elements of N ₂ may be set as close as possible to L/N₁. Since the elements of N ₂ are preferably positive integers, some elements of N ₂ are preferably incremented or decremented from the default value of the integer nearest L/N₁. While satisfying the constraint

${L = {\sum\limits_{i = 1}^{N_{1}}{N_{2}(i)}}},$

preferably N₂(i)≦N₂(j) when i>j.

Although equation (30) was derived assuming N₂(i)=N₂, some embodiments compute different values of N₂(i) for each value of z. Equation (30) may be used to compute N₁, while the elements of N ₂ may be computed using a different algorithm (for example, equation (32) below), or simply taken from a look-up table where a N ₂ vector is stored for each value of N₁. Equation (32) provides a simple computation for elements of N ₂ given N₁ and L. It is often preferable to explore more candidates for the most likely candidates of the first symbol, by making N₂(i)≦N₂(j) when i>j. The factor α_(i) can be used to accomplish this, if it decreases as z increases, or α_(i) may also be a constant.

$\begin{matrix} {{N_{2}(i)} = \left\{ \begin{matrix} {{round}\left( {\frac{L - N_{1} + i - 1 - {\sum\limits_{k = 1}^{i - 1}{N_{2}(k)}}}{N_{1} + i - 1}\alpha_{i}} \right)} & {{{if}\mspace{14mu} i} < N_{1}} \\ {L - {\sum\limits_{k = 1}^{N_{1}}{N_{2}(k)}}} & {{{if}\mspace{14mu} i} = {N_{1}.}} \end{matrix} \right.} & (32) \end{matrix}$

The notation round(x) indicates the integer nearest x.

Consider now MIMO engine 320. There are at least two different embodiments of this MIMO engine; some of which are when a triangular matrix R is input, and some of which are when a full matrix H is input. In the following discussion, the MIMO engine is defined as having the matrix R is input. Later in this disclosure embodiments are considered where the MIMO engine is defined when the matrix H is input. Note that any MIMO engine 320 embodiment that currently exists or is developed in the future can be coupled to the leaf-node predictor 310; it is preferred that it take the inputs N₁ and N ₂ and compute a list

and the cost of each of the L elements in the list.

First consider embodiments of MIMO engine 320 when a triangular matrix R is input along with the MIMO equalizer output y. The instructions input into MIMO engine 320 from LNP 310 are in the form of two (2) parameters. The first parameter is an integer N₁ which instructs MIMO engine 320 to enumerate the N₁ best symbol values for the first symbol s₁ and compute the score of each value. MIMO engine 320 thus computes Score_(1,i)=|y₁−R_(1,1)ŝ_(1,i)|² for i=1 to N₁, where ŝ_(1,i) is the i-th best estimate of s₁. The second parameter input into MIMO engine 320 is a vector of integers N ₂=[N₂(1) N₂(2) . . . N₂(N₁)], which instructs MIMO engine 320 to enumerate the N₂(i) best symbol values for the second symbol s₂ assuming that s₁=ŝ_(1,i). Therefore, MIMO engine 320 computes; z_(2,i)=y₂−R_(2,1)ŝ_(1,i) and Score_(2,i,j)=|z_(2,i)−R_(2,2)ŝ_(2,i,j)|² for i=1 to N₁ and for j=1 to N₂(i), where ŝ_(2,i,j) is the j-th best estimate of s₂ assuming s₁=ŝ_(1,i). The final outputs of MIMO engine 320 are the set of costs,

={Score_(1,i)+Score_(2,i,j)}, and the set of enumerated possible channel input

$L = {\left\{ \begin{bmatrix} {\hat{s}}_{1,i} \\ {\hat{s}}_{2,i,j} \end{bmatrix} \right\}.}$

MIMO engine 320 uses a constellation-sorting function to decide on the i-th best candidate for a given symbol. In tree-search terminology, this is the same as computing the i-th best branch exiting a given node. MIMO engine 320 of LNP detector 300 can use any constellation-sorting function to determine the N₁ or N₂(i) best branches (or symbols) to enumerate from a given node in the tree. A generic function to represent this sorting operation is preferably defined:

ƒ(y,R,A,i)=i-th best candidate from the alphabet A.  (33)

There are many ways to implement this sorting operation, and LNP detector 300 will work with any of them—even suboptimal sorting operations. Another, and possibly more intuitive, way of expressing equation (8) would be:

ƒ(y,R,A,i)=i-th nearest symbol to y/R in A.  (34)

The i-th best candidate for the first symbol is therefore expressed as ƒ(y₁,R_(1,1),A₁,i).

For the i-th candidate of the first symbol, MIMO engine 320 computes the cost of the leaf nodes corresponding to the N₂(i) best values of the second symbol. This computation preferably employs interference cancellation that assumes that the i-th candidate for the first symbol is the actual channel input. The result of this interference cancellation is defined in equation (9). For the N=2 special case, the interference result can be written as:

z=y ₂ −R _(2,1) ŝ ₁,  (35)

The i-th best candidate for the second symbol, when the candidate for the first symbol is ŝ₁ is preferably computed using the constellation sorting function ƒ(z, R_(2,2), A₂, i).

One output of MIMO engine 320 is a list of candidate vectors

which correspond to the leaf nodes specified by the input parameters N₁ and N ₂. Another output is the cost of each of the candidate vectors in the output list, the list of costs is labeled as

Returning momentarily to the example tree diagram of FIG. 1, it can be seen that N₁=4, and N ₂=[4 3 2 1]. The leaf nodes that are enumerated in that example are indicated with solid lines.

The score of a particular symbol can be defined in multiple ways. A generic function to represent this operation is:

g(y,R,ŝ)=score of the symbol ŝ.  (36)

One definition of this function is the mean-squared error:

g(y,R,ŝ)=|y−Rŝ| ^(p),  (37)

where preferably p=2, but other values like p=1 may also be used to reduce complexity. Other possible definitions include approximations of the above definition that may be less complex to compute, as well as mathematically equivalent expressions that may be less complex to compute.

For a generic set of input parameters N₁ and N ₂, MIMO engine 320 can be described by the following exemplary pseudocode. It will be appreciated by one skilled in the art that such exemplary pseudocode is provided strictly as an example, and not by way of limitation, as it can be rewritten with different pseudocode that is functionally equivalent. It should be further appreciated that MIMO engine 320 as modeled by this pseudocode may alternatively be implemented using hardware, or a combination of hardware and software.

The MIMO Engine (Given R and y)

 1. for i = 1 to N₁  2.  ŝ₁ = f (y₁, R_(1,1), A₁,i)  3.  z = y₂ − R_(2,1)ŝ₁  4.  Compute the score of ŝ₁, c₁ = g(y₁, R_(1,1), ŝ₁).  5.  for j = 1 to N₂(i)  6.   ŝ₂ = f(z, R_(2, 2,), A₂, j) $\mspace{11mu} {7.\mspace{56mu} {Add}\mspace{14mu} {the}\mspace{14mu} {candidate}\mspace{14mu} {{vector}\mspace{14mu}\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \end{bmatrix}}{\quad\mspace{14mu} {{to}\mspace{14mu} {the}\mspace{14mu} {list}\mspace{14mu} .}}}$  8.   Compute the score of the candidate vector:     c₂ = g(z, R_(2,2), ŝ₂) .  9.   Add the cost of the candidate vector c=c₁+c₂,     to the set of output costs  

10.  end 11. end Now consider embodiments of MIMO engine 320 when a full matrix H is input along with the channel output r. In this case, MIMO engine 320 operates differently. Specifically, the cost computation is not separated into two score computations. Instead each candidate in the list is constructed, and then its cost is directly computed. Otherwise, MIMO engine 320 operates very much as previously described. The following pseudocode gives an example of one way the MIMO engine may operate when it is given H and r.

The MIMO Engine (Given H and r)

 1. y₁ = first output of linear detector, for example y₁ may be the first   element in the vector y, where y = ({tilde over (H)}^(H){tilde over (H)} + α²{circumflex over (σ)}²I)⁻¹{tilde over (H)}^(H)r , where {tilde over (H)} = HΠ.  2. for i = 1 to N₁  3.  ŝ₁ = f(y₁,1,A₁,i) $\; {{{4.\mspace{40mu} z} = {\frac{{\overset{\sim}{h}}_{2}^{H}}{{\overset{\sim}{h}}_{2}^{H}{\overset{\sim}{h}}_{2}}\left( {r - {{\overset{\sim}{h}}_{1}{\hat{s}}_{1}}} \right)}},{{{where}\mspace{14mu} \overset{\sim}{H}} = \begin{bmatrix} {\overset{\sim}{h}}_{1} & {\overset{\sim}{h}}_{2} \end{bmatrix}}}$  5.  for j = 1 to N₂(i)  6.   ŝ₂ = f (z,l, A₂, j) $\mspace{11mu} {7.\mspace{56mu} {Add}\mspace{14mu} {the}\mspace{14mu} {candidate}\mspace{14mu} {{vector}\mspace{14mu}\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \end{bmatrix}}{\quad\mspace{14mu} {{to}\mspace{14mu} {the}\mspace{14mu} {list}\mspace{14mu} .}}}$  8.  Compute the cost of the candidate vector:      ${{c = {g\left( {r,H,\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \end{bmatrix}} \right)}},{where}}\mspace{14mu}$      $c = {{g\left( {r,H,\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \end{bmatrix}} \right)}\mspace{14mu} {is}\mspace{14mu} {preferably}\mspace{14mu} {defined}\mspace{14mu} {as}}$      ${g\left( {r,H,\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \end{bmatrix}} \right)} = {{{r - {\overset{\sim}{H}\begin{bmatrix} {\hat{s}}_{1} \\ {\hat{s}}_{2} \end{bmatrix}}}}^{2}.}$  9.   Add the cost of the candidate vector c,     to the set of output costs  

. 10.  end 11. end

MIMO engine 320 and leaf-node predictor 310 together make up the LNP detector 300. In one embodiment, such as that illustrated in the block diagram of FIG. 9, the outputs from MIMO engine 320 could be used to compute the log-likelihood ratio (LLR) values of each bit. Leaf node predictor 310 provides inputs to MIMO engine 320, which in turn generates a list of candidate vectors

, and the cost of each candidate

_(c). These outputs are used to compute LLR values; this is a preferable embodiment for MIMO channels with two inputs. In another embodiment, the MIMO detector that is processing a channel with more than two inputs may use embodiments of the LNP detector to generate one or more lists of two-dimensional candidate vectors, which can then be used to implement a MIMO detector for a channel with more than two inputs.

Many modifications and other embodiments of the invention will come to mind to one skilled in the art to which this invention pertains having the benefit of the teachings presented in the foregoing descriptions, and the associated drawings. Therefore, the above discussion is meant to be illustrative of the principles and various embodiments of the disclosure; it is to be understood that the invention is not to be limited to the specific embodiments disclosed. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation. It is intended that the following claims be interpreted to embrace all such variations and modifications. 

1-17. (canceled)
 18. A method for building a look-up table for a receiver, comprising: analytically generating at least one parameter value for use by a multiple-input multiple-output (MIMO) detector corresponding to a channel metric; and storing, in a look-up table, the generated at least one parameter value and the corresponding channel metric.
 19. The method of claim 18, wherein analytically generating comprises generating the at least one parameter value using at least one of: a Taylor series approximation, a Max-Log approximation, no noise variance, and an assumption that all elements in at least one parameter vector are equal.
 20. The method of claim 18, wherein the analytically generating further comprises analytically generating by a leaf-node predictor.
 21. The method of claim 18, wherein the storing further comprises storing a noise-variance in the look-up table.
 22. The method of claim 18, further comprising setting a permutation matrix to minimize a range of parameter values to store in the look-up table. 23-25. (canceled) 